Modular Checkpointing for Atomicity

Modular Checkpointing for Atomicity

Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execution in multi-threaded code is not obvious, however. For a thread to correctly re-execute a region of code, it must ensure that all other threads which have witnessed its unwanted effects within that region are also rev...

Atomicity for Concurrent Programs

Atomicity for XML Databases

With more and more data stored into XML databases, there is a need to provide the same level of failure resilience and robustness that users have come to expect from relational database systems. In this work, we discuss strategies to provide the transactional aspect of atomicity to XML databases. The main contribution of this paper is to propose a novel approach for performing updates-in-place ...

Algorithms for Atomicity

We study the algorithmics of checking atomicity of in concurrent programs. Unearthing fundamental results behind scheduling algorithms in database control, we build space-efficient monitoring algorithms for checking atomicity. Second, by interpreting the monitoring algorithm as a deterministic automaton, we solve several key model checking problems for checking atomicity of finite-state concurr...

Hybrid Atomicity for Nested Transactions

Abst rac t . This paper defines the notion of hybrid atomicityfor nested transaction systems, and presents and verifies an algorithm providing this property. Hybrid atomicity is a modular property; it allows the correctness of a system to be deduced from the fact that each object is implemented to have the property. It allows more concurrency than dynamic atomicity, by assigning timestamps to t...